Lucas Sequences Whose 12th or 9th Term Is a Square

نویسندگان

  • A. Bremner
  • N. Tzanakis
چکیده

The sequence {Un(1,−1)} is the familiar Fibonacci sequence, and it was proved by Cohn [12] in 1964 that the only perfect square greater than 1 in this sequence is U12 = 144. The question arises, for which parameters P , Q, can Un(P,Q) be a perfect square? This has been studied by several authors: see for example Cohn [13] [14] [15], Ljunggren [22], and Robbins [25]. Using Baker’s method on linear forms in logarithms, work of Shorey & Tijdeman [26] implies that there can only be finitely many squares in the sequence {Un(P,Q)}. Ribenboim and McDaniel [23] with only elementary methods show that when P and Q are odd, and P 2 − 4Q > 0, then Un can be square only for n = 0, 1, 2, 3, 6 or 12; and that there are at most two indices greater than 1 for which Un can be square. They characterize fully the instances when Un = 2, for n = 2, 3, 6, and observe that U12 = 2 if and only if there is a solution to the Diophantine system

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

2 6 A ug 2 00 4 Lucas sequences whose 8 th term is a square

For each positive integer n ≤ 7 we describe all Lucas sequences with (P,Q) = 1 having the property that Un(P,Q) is a perfect square. The arguments are elementary. We also find all Lucas sequences such that U8(P,Q) is a perfect square. This reduces to a number of problems of similar type, namely, finding all points on an elliptic curve defined over a quartic number field subject to a “Q-rational...

متن کامل

A ug 2 00 4 Lucas sequences whose 8 th term is a square

For each positive integer n ≤ 7 we describe all Lucas sequences with (P,Q) = 1 having the property that Un(P,Q) is a perfect square. The arguments are elementary. We also find all Lucas sequences such that U8(P,Q) is a perfect square. This reduces to a number of problems of similar type, namely, finding all points on an elliptic curve defined over a quartic number field subject to a “Q-rational...

متن کامل

The (non-)existence of perfect codes in Lucas cubes

A Fibonacci string of length $n$ is a binary string $b = b_1b_2ldots b_n$ in which for every $1 leq i < n$, $b_icdot b_{i+1} = 0$. In other words, a Fibonacci string is a binary string without 11 as a substring. Similarly, a Lucas string is a Fibonacci string $b_1b_2ldots b_n$ that $b_1cdot b_n = 0$. For a natural number $ngeq1$, a Fibonacci cube of dimension $n$ is denoted by $Gamma_n$ and i...

متن کامل

On the Properties of Balancing and Lucas-Balancing $p$-Numbers

The main goal of this paper is to develop a new generalization of balancing and Lucas-balancing sequences namely balancing and Lucas-balancing $p$-numbers and derive several identities related to them. Some combinatorial forms of these numbers are also presented.

متن کامل

Ela New Families of Integer Matrices Whose Leading Principal Minors Form Some Well-known Sequences∗

The purpose of this article is to obtain some new infinite families of Toeplitz matrices, 7-matrices and generalized Pascal triangles whose leading principal minors form the Fibonacci, Lucas, Pell and Jacobsthal sequences. We also present a new proof for Theorem 3.1 in [R. Bacher. Determinants of matrices related to the Pascal triangle. J. Théor. Nombres Bordeaux, 14:19–41, 2002.].

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999